On the Impact of Cognitive Limits in Combinatorial Auctions: An Experimental Study in the Context of Spectrum Auction Design

نویسندگان

  • Tobias Scheffel
  • Georg Ziegler
  • Martin Bichler
چکیده

Combinatorial auctions have been studied analytically for several years, but only limited experimental results are available, in particular for auctions with more than 10 items. We investigate the Hierarchical Package Bidding auction (HPB), the Combinatorial Clock auction (CC), and one pseudo-dual price auction (PDP) experimentally, as all these formats were used or suggested for high-stakes spectrum auctions. We want to understand the impact that different auction formats have on bidder behavior and allocative efficiency. Interestingly, we find that the main source of inefficiency in all formats is the bidders’ preselection of packages, rather than their strategies or auction rules; bidders mostly preselect a small number of packages of interest early in the auction. CC achieves high efficiency and revenue in all experiments, but HPB yields similar results even in value models, where hierarchical pre-packaging is difficult. Due to their influence on the decision of the US Federal Communication Commission, we intentionally repeated a set of experiments conducted by Goeree and Holt (GH) [J.K. Goeree, C.A. Holt, Hierarchical package bidding: A paper & pencil combinatorial auction, Games Econ. Behav. (2008)]. We get similar aggregate results but in contrast to GH, we find that small bidders have more difficulties in coordinating their bids to outbid a national bidder in a threshold problem with HPB. In addition to the value models with global synergies in GH, we used value models where bidders have local synergies, which play a significant role in spectrum auctions in the field and lead to different results.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Winner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search

A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...

متن کامل

Achieving Simultaneous Spectrum Utilization and Revenue Improvements in Practical Wireless Spectrum Auctions

Spectrum is a valuable, scarce and finite natural resource that is needed for many different applications, so efficient use of the scarce radio spectrum is important for accommodating the rapid growth of wireless communications. Spectrum auctions are one of the best-known market-based solutions to improve the efficiency of spectrum use. However, Spectrum auctions are fundamentally differen...

متن کامل

A Comparative Study of Multi-Attribute Continuous Double Auction Mechanisms

Auctions have been as a competitive method of buying and selling valuable or rare items for a long time. Single-sided auctions in which participants negotiate on a single attribute (e.g. price) are very popular. Double auctions and negotiation on multiple attributes create more advantages compared to single-sided and single-attribute auctions. Nonetheless, this adds the complexity of the auctio...

متن کامل

The Impact of a Training Program based on Resilience Components on the Cognitive Emotion Regulation of Mothers of Children with Autism Spectrum Disorder

The purpose of the present study was to design a training program based on resilience components and evaluate its impact on the cognitive emotion regulation of mothers of children with autism spectrum disorder. In this quasi-experimental research, first the training program was designed based on resilience components and then the program effectiveness was assessed through a pretest-posttest con...

متن کامل

An Optimization Framework for Combining the Petroleum Replenishment Problem with the Optimal Bidding in Combinatorial Auctions

We address in this paper a periodic petroleum station replenishment problem (PPSRP) that aims to plan the delivery of petroleum products to a set of geographically dispatched stations. It is assumed that each station is characterized by its weekly demand and by its frequency of service. The main objective of the delivery process is to minimize the total travelled distance by the vailable trucks...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010